A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem

We consider the unconstrained traveling tournament problem, a sports timetabling problem that minimizes of teams. Since its introduction about 20 years ago, most research was devoted to modeling and reformulation approaches. In this paper we carry out polyhedral study for cubic integer programming formulation by establishing dimension hull as well faces induced model inequalities. Moreover, introduce new class inequalities show they are facet-defining. Finally, evaluate impact these on linear bounds.